An effective parallelization of execution of multijoins in multiprocessor systems
نویسندگان
چکیده
In this paper, we study a synchronous execution strategy f o r parallel j o i n computation in multiprocessor systems. Through a fur ther comprehensive investigation of the processor allocation problem and interoperator parallelization problem, we present a new algorithm for producing an effective parallelization plan f o r processing multijoins. Besides theoretical analysis, the e f ic iency and effectiveness of our new algorithm are supported by our experiments.
منابع مشابه
Efficient parallelization of the genetic algorithm solution of traveling salesman problem on multi-core and many-core systems
Efficient parallelization of genetic algorithms (GAs) on state-of-the-art multi-threading or many-threading platforms is a challenge due to the difficulty of schedulation of hardware resources regarding the concurrency of threads. In this paper, for resolving the problem, a novel method is proposed, which parallelizes the GA by designing three concurrent kernels, each of which running some depe...
متن کاملParallelization Strategies for Variable Neighborhood Search
We analyze five parallelization strategies for the Variable Neighborhood Search (VNS) meta-heuristic. They are based on asynchronous cooperation of several search threads. We tested parallelization on various levels, from a low-level parallel neighborhood exploration, through medium-grained asynchronous execution of basic VNS steps (shaking and local search), to the coarse-grained asynchronous ...
متن کاملMultilevel Parallelization of AutoDock 4.2
BACKGROUND Virtual (computational) screening is an increasingly important tool for drug discovery. AutoDock is a popular open-source application for performing molecular docking, the prediction of ligand-receptor interactions. AutoDock is a serial application, though several previous efforts have parallelized various aspects of the program. In this paper, we report on a multi-level parallelizat...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملA Case Study of Parallelization: A Simple Fractal Generator
Parallel architectures and multiprocessor multithreaded operating systems have become widely available. In order to get maximum benefits from them, programmers must consider how many and which specific hardware and software resources are used by the application during its execution. In this report, we discuss some methods to parallelize the code and the data of a simple fractal generator, tryin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996